منابع مشابه
Revisiting interval graphs for Network Science
The vertices of an interval graph represent intervals over a real line where overlapping intervals denote that their corresponding vertices are adjacent. This implies that the vertices are measurable by a metric and there exists a linear structure in the system. The generalization is an embedding of a graph onto a multi-dimensional Euclidean space and it was used by scientists to study the mult...
متن کاملRevisiting the General Concept of Network Centralities: A Propose for Centrality Analysis in Network Science
Drug Design and Bioinformatics Unit, Medical Biotechnology Department, Biotechnology Research Center, Pasteur Institute of Iran, 69 Pasteur St, PO Box 13164, Tehran, Iran Department of Applied Mathematics, Faculty of Mathematical Sciences, Tarbiat Modares University, Jalal Ale Ahmad Highway, PO Box 14115-134, Tehran, Iran Faculty of New Sciences and Technologies, University of Tehran, North Kar...
متن کاملOpen - Interval Graphs versus Closed - Interval Grap
A graph G = (V, E) is said to be represented by a family F of nonempty sets if there is a bijection f:V--*F such that uv ~ E if and only iff(u)Nf(v)q=~. It is proved that if G is a countable graph then G can be represented by open intervals on the real line if and only if G can be represented by closed intervals on the real line, however, this is no longer true when G is an uncountable graph. S...
متن کاملRevisiting Interval Protection, a.k.a. Partial Cell Suppression, for Tabular Data
Interval protection or partial cell suppression was introduced in “M. Fischetti, J.-J. Salazar, Partial cell suppression: A new methodology for statistical disclosure control, Statistics and Computing, 13, 13– 21, 2003” as a “linearization” of the difficult cell suppression problem. Interval protection replaces some cells by intervals containing the original cell value, unlike in cell suppressi...
متن کاملk - Interval - filament graphs
For a fixed k, an oriented graph is k-transitive if it is acyclic and for every directed path p=u1→u2→...→uk+2 with k+2 vertices, p induces a clique if each of the two subpaths u1→u2→...→uk+1 and u2→...→uk+2 induces a clique. We describe an algorithm to find a maximum weight clique in a k-transitive graph. Consider a hereditary family G of graphs. A graph H(V,E) is called G-k-mixed if its edge ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complex Networks
سال: 2015
ISSN: 2051-1310,2051-1329
DOI: 10.1093/comnet/cnv023